Reasoning under inconsistency: A forgetting-based approach

نویسندگان

  • Jérôme Lang
  • Pierre Marquis
چکیده

In this paper, a fairly general framework for reasoning from inconsistent propositional basesis defined. Variable forgetting is used as a basic operation for weakening pieces of infor-mation so as to restore consistency. The key notion is that of recoveries, which are sets ofvariables whose forgetting enables restoring consistency. Several criteria for defining pre-ferred recoveries are proposed, depending on whether the focus is laid on the relative rele-vance of the atoms or the relative entrenchment of the pieces of information (or both). Ourframework encompasses several previous approaches as specific cases, including reasoningfrom preferred consistent subsets, and some forms of information merging. Interestingly,the gain in flexibility and generality offered by our framework does not imply a complexityshift compared to these specific cases.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Forgetting-based Approach for Reasoning with Inconsistent Distributed Ontologies

In the context of multiple distributed ontologies, we are often confronted with the problem of dealing with inconsistency. In this paper, we propose an approach for reasoning with inconsistent distributed ontologies based on concept forgetting. We firstly define concept forgetting in description logics. We then adapt the notions of recoveries and preferred recoveries in propositional logic to d...

متن کامل

D 1 . 2 . 4 Inconsistency - tolerant Reasoning with Networked Ontologies

In this deliverable, we discuss the problem of reasoning with inconsistent networked ontologies. We first extend the semantics of description logic ALC with a four-valued semantics. This will allow us to reasoning with inconsistent ontologies non-trivially. We implement an algorithm for reasoning with the four-valued semantics and provide a prototype. We then propose a bilatticebased semantics ...

متن کامل

Semantic forgetting in answer set programming

The notion of forgetting, also known as variable elimination, has been investigated extensively in the context of classical logic, but less so in (nonmonotonic) logic programming and nonmonotonic reasoning. The few approaches that exist are based on syntactic modifications of a program at hand. In this paper, we establish a declarative theory of forgetting for disjunctive logic programs under a...

متن کامل

LPForget: A System of Forgetting in Answer Set Programming

A novel declarative approach of forgetting in answer set programming (ASP) has been proposed recently. In this paper we report a system prototype of forgetting in ASP, called LPForget. It consists of two modules: (1) Forgetting: computing the result of forgetting about certain literals in logic program under the answer set semantics; (2) CRS: application of forgetting in resolving conflict (or ...

متن کامل

Forgetting and Conflict Resolving in Disjunctive Logic Programming

We establish a declarative theory of forgetting for disjunctive logic programs. The suitability of this theory is justified by a number of desirable properties. In particular, one of our results shows that our notion of forgetting is completely captured by the classical forgetting. A transformation-based algorithm is also developed for computing the result of forgetting. We also provide an anal...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Artif. Intell.

دوره 174  شماره 

صفحات  -

تاریخ انتشار 2010